Software Implementation of Arithmetic in F3m
نویسندگان
چکیده
Fast arithmetic for characteristic three finite fields F3m is desirable in pairing-based cryptography because there is a suitable family of elliptic curves over F3m having embedding degree 6. In this paper we present some structure results for Gaussian normal bases of F3m , and use the results to devise faster multiplication algorithms. We carefully compare multiplication in F3m using polynomial bases and Gaussian normal bases. Finally, we compare the speed of encryption and decryption for the Boneh-Franklin and Sakai-Kasahara identity-based encryption schemes at the 128-bit security level, in the case where supersingular elliptic curves with embedding degrees 2, 4 and 6 are employed.
منابع مشابه
Pairing in Characteristic Three
Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we discuss several algorithms to compute the ηT pairing in characteristic three and suggest further impr...
متن کاملAlgorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three
Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we discuss several algorithms to compute the ηT pairing in characteristic three and suggest further impr...
متن کاملSkew Hadamard Difference Sets from Dickson Polynomials of Order 7
Skew Hadamard difference sets have been an interesting topic of study for over 70 years. For a long time, it had been conjectured the classical Paley difference sets (the set of nonzero quadratic residues in Fq where q ≡ 3 mod 4) were the only example in Abelian groups. In 2006, the first author and Yuan disproved this conjecture by showing that the image set of D5(x2, u) is a new skew Hadamard...
متن کاملHardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propose here a novel hardware implementation of Miller’s loop based on a pipelined Karatsuba-Ofman multiplier. Thanks to a careful selection of algorithms for computing the tower field arithmetic associated to the Tate pairing, we ma...
متن کاملA note on efficient computation of cube roots in characteristic 3
The cost of the folklore algorithm for computing cube roots in F3m in standard polynomial basis is less that one multiplication, but still O(m). Here we show that, if F3m is represented in trinomial basis as F3[x]/(x + ax + b) with a, b = ±1, the actual cost of computing cube roots in F3m is only O(m).
متن کامل